Edon-R, An Infinite Family of Cryptographic Hash Functions
نویسندگان
چکیده
We propose a new infinite family of cryptographic hash functions, Edon–R, based on a recently defined candidate one-way function. Edon–R is a class of hash functions with variable output lengths. It is de fined using quasigroups and quasigroup string trans formations.
منابع مشابه
Two infinite classes of cryptographic hash functions
We offer two new definitions of two infinite classes of strongly collision free hash functions that we gave a name “Edon”–C and “Edon”– R. Beside the fact that “Edon” are infinite classes of hash functions, “Edon” hash functions have other “good” properties such as possibility to have variable length of output, and also their strongly collision free property can be mathematically and experiment...
متن کاملOn the Randomness and Regularity of Reduced Edon-R Compression Function
EDON-R is one of the candidate hash functions for the ongoing NIST competition for the next cryptographic hash standard called SHA-3. Its construction is based on algebraic properties of non-commutative and non-associative quasigroups of orders 2 and 2. In this paper we are giving some of our results in investigation of the randomness and regularity of reduced EDON-R compression functions over ...
متن کاملEdon-R(256, 384, 512) - an Efficient Implementation of Edon-R} Family of Cryptographic Hash Functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–R. They produce message digests of length n = 256, 384, 512 bits and project security of 2 n 2 hash computations for finding collisions and 2 hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damg̊ard but can be seen as wide-pipe iterated compression...
متن کاملCSE 599 b : Cryptography ( Winter 2006 ) Lecture 14 : Cryptographic Hash Functions 17 February 2006
and thus being a universal hash function family is equivalent to having a probability distribution on functions from D to R that maps elements of D in a uniform pairwise independent fashion. Typically we will consider D = {0, 1} and R = {0, 1} form < n. The following construction due to Dietzfelbinger is particularly convenient: The space of keys is all strings K = (a, b) where a, b ∈ {0, 1} an...
متن کاملLightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives
Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 8 شماره
صفحات -
تاریخ انتشار 2009